Information Theoretic Authentication and Secrecy Codes in the Splitting Model

Authentication codes and bipartite graphs

In this paper, a characterization of authentication codes in terms of bipartite graphs is given. By using such a characterization, two necessary and sufficient conditions for a minimal authentication code with perfect secrecy are derived. The probabilities of a successful impersonation and of a successful substitution attack are discussed. As a result, some (optimal) minimal authentication code...

Combinatorial Designs for Authentication and Secrecy Codes

Combinatorial design theory is a very active area of mathematical research, with many applications in communications and information theory, computer science, statistics, engineering, and life sciences. As one of the fundamental discrete structures, combinatorial designs are used in fields as diverse as error-correcting codes, statistical design of experiments, cryptography and information secu...

Authentication Schemes, Perfect Local Randomizers, Perfect Secrecy and Secret Sharing Schemes

Robust Biometric Authentication from an Information Theoretic Perspective

Robust biometric authentication is studied from an information theoretic perspective. Compound sources are used to account for uncertainty in the knowledge of the source statistics and are further used to model certain attack classes. It is shown that authentication is robust against source uncertainty and a special class of attacks under the strong secrecy condition. A single-letter characteri...

Almost universal codes for MIMO wiretap channels

Despite several works on secrecy coding for fading and MIMO wiretap channels from an error probability perspective, the construction of information theoretically secure codes over such channels remains as an open problem. In this paper, we consider a fading wiretap channel model where the transmitter has only partial statistical channel state information. We extend the flatness factor criterion...